Joins in the strong Weihrauch degrees

نویسنده

  • Damir D. Dzhafarov
چکیده

The Weihrauch degrees and strong Weihrauch degrees are partially ordered structures representing degrees of unsolvability of various mathematical problems. Their study has been widely applied in computable analysis, complexity theory, and more recently, also in computable combinatorics. We answer an open question about the algebraic structure of the strong Weihrauch degrees, by exhibiting a join operation that turns these degrees into a lattice. Previously, the strong Weihrauch degrees were only known to form a lower semi-lattice. We then show that unlike the Weihrauch degrees, which are known to form a distributive lattice, the lattice of strong Weihrauch degrees is not distributive. Therefore, the two structures are not isomorphic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weihrauch Degrees, Omniscience Principles and Weak Computability

In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions on represented spaces. We call the corresponding equivalence classes Weihrauch degrees and we show that the corresponding partial order induces a lower semi-lattice with the disjoint union of multi-valued functions as greatest ...

متن کامل

The degree structure of Weihrauch-reducibility

We answer a question [2] by Vasco Brattka and Guido Gherardi by proving that the Weihrauch lattice is not a Brouwer algebra. The computable Weihrauch lattice is also not a Heyting algebra, but the continuous Weihrauch lattice is. We further investigate embeddings of the Medvedev degrees into the Weihrauch degrees.

متن کامل

On the algebraic structure of Weihrauch degrees

We introduce two new operations (compositional products and implication) on Weihrauch degrees, and investigate the overall algebraic structure. The validity of the various distributivity laws is studied and forms the basis for a comparison with similar structures such as residuated lattices and concurrent Kleene algebras. Introducing the notion of an ideal with respect to the compositional prod...

متن کامل

Weihrauch Degrees of Finding Equilibria in Sequential Games

We consider the degrees of non-computability (Weihrauch degrees) of finding winning strategies (or more generally, Nash equilibria) in infinite sequential games with certain winning sets (or more generally, outcome sets). In particular, we show that as the complexity of the winning sets increases in the difference hierarchy, the complexity of constructing winning strategies increases in the eff...

متن کامل

Game Characterizations and Lower Cones in the Weihrauch Degrees

We introduce generalized Wadge games and show that each lower cone in the Weihrauch degrees is characterized by such a game. These generalized Wadge games subsume the original Wadge games, the eraser and backtrack games as well as variants of Semmes’ tree games. As a new example we introduce the tree derivative games which characterize all even finite levels of the Baire hierarchy, and a varian...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1704.01494  شماره 

صفحات  -

تاریخ انتشار 2017